Multi-Area Interchange Scheduling Under Uncertainty
نویسندگان
چکیده
منابع مشابه
Scheduling Dags under Uncertainty
This paper introduces a parallel scheduling problem where a directed acyclic graph modeling t tasks and their dependencies needs to be executed on n unreliable workers. Worker i executes task j correctly with probability pi,j . The goal is to find a regimen Σ, that dictates how workers get assigned to tasks (possibly in parallel and redundantly) throughout execution, so as to minimize the expec...
متن کاملMULTI-OBJECTIVE ROUTING AND SCHEDULING IN FLEXIBLE MANUFACTURING SYSTEMS UNDER UNCERTAINTY
The efficiency of transportation system management plays an important role in the planning and operation efficiency of flexible manufacturing systems. Automated Guided Vehicles (AGV) are part of diversified and advanced techniques in the field of material transportation which have many applications today and act as an intermediary between operating and storage equipment and are routed and contr...
متن کاملAirline Crew Scheduling Under Uncertainty
A crew scheduling algorithms widely used in practice assume no disruptions. Because disruptions often occur, the actual cost of the resulting crew schedules is often greater. We consider algorithms for finding crew schedules that perform well in practice. The deterministic crew scheduling model is an approximation of crew scheduling under uncertainty with the assumption that all pairings will o...
متن کاملResource-Bounded Scheduling Under Uncertainty
We discuss the problem of scheduling tasks that consume uncertain amounts of a resource with known capacity and where the tasks have uncertain utility. In these circumstances, we would like to find schedules that exceed a lower bound on the expected utility when executed. We describe several different event execution models that motivate different formulations of the expected value of a schedul...
متن کاملOn Optimal Scheduling under Uncertainty
In this work we treat the problem of scheduling under two types of temporal uncertainty, setbased and probabilistic. For the former we define appropriate optimality criteria and develop an algorithm for finding optimal scheduling strategies using a backward reachability algorithm for timed automata. For probabilistic uncertainty we define and solve a special case of continuoustime Markov Decisi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2018
ISSN: 0885-8950,1558-0679
DOI: 10.1109/tpwrs.2017.2727326